Nearest Labelset Using Double Distances for Multi-label Classification

Multi-label classification is a type of supervised learning where an instance may belong to multiple labels simultaneously. Predicting each label independently has been criticized for not exploiting any correlation between labels. In this paper we propose a novel approach, Nearest Labelset using Double Distances (NLDD), that predicts the labelset observed in the training data that minimizes a weighted sum of the distances in both the feature space and the label space to the new instance. The weights specify the relative tradeoff between the two distances. The weights are estimated from a binomial regression of the number of misclassified labels as a function of the two distances. Model parameters are estimated by maximum likelihood. NLDD only considers labelsets observed in the training data, thus implicitly taking into account label dependencies. Experiments on benchmark multi-label data sets show that the proposed method on average outperforms other well-known approaches in terms of Hamming loss, 0/1 loss, and multi-label accuracy and ranks second after ECC on the F-measure

Nonlinear photon-atom coupling with 4Pi microscopy

Implementing nonlinear interactions between single photons and single atoms is at the forefront of optical physics. Motivated by the prospects of deterministic all-optical quantum logic, many efforts are currently underway to find suitable experimental techniques. Focusing the incident photons onto the atom with a lens yielded promising results, but is limited by diffraction to moderate interaction strengths. However, techniques to exceed the diffraction limit are known from high-resolution imaging. In this work, we adapt a super-resolution imaging technique, 4Pi microscopy, to efficiently couple light to a single atom. We observe 36.6(3)% extinction of the incident field, and a modified photon statistics of the transmitted field -- indicating nonlinear interaction at the single-photon level.Comment: 8 pages, 8 figure

A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials

Let $\mathbb{F}_q$ be a finite field of characteristic $p$. In this paper we prove that the $c$-Boomerang Uniformity, $c \neq 0$, for all permutation monomials $x^d$, where $d > 1$ and $p \nmid d$, is bounded by $d^2$. Further, we utilize this bound to estimate the $c$-boomerang uniformity of a large class of Generalized Triangular Dynamical Systems, a polynomial-based approach to describe cryptographic permutations, including the well-known Substitution-Permutation Network

Near-surface stellar magneto-convection: simulations for the Sun and a metal-poor solar analog

We present 2D local box simulations of near-surface radiative magneto-convection with prescribed magnetic flux, carried out with the MHD version of the CO5BOLD code for the Sun and a solar-like star with a metal-poor chemical composition (metal abundances reduced by a factor 100, [M/H]=-2). The resulting magneto-hydrodynamical models can be used to study the influence of the metallicity on the properties of magnetized stellar atmospheres. A preliminary analysis indicates that the horizontal magnetic field component tends to be significantly stronger in the optically thin layers of metal-poor stellar atmospheres.Comment: Proc. IAU Symposium 259, Cosmic Magnetic Fields: from Planets, to Stars and Galaxies, K.G. Strassmeier, A.G. Kosovichev and J.E. Beckman, eds. (2009) p.23

An Algebraic System for Constructing Cryptographic Permutations over Finite Fields

In this paper we identify polynomial dynamical systems over finite fields as the central component of almost all iterative block cipher design strategies over finite fields. We propose a generalized triangular polynomial dynamical system (GTDS), and give a generic algebraic definition of iterative (keyed) permutation using GTDS. Our GTDS-based generic definition is able to describe widely used and well-known design strategies such as substitution permutation network (SPN), Feistel network and their variants among others. We show that the Lai-Massey design strategy for (keyed) permutations is also described by the GTDS. Our generic algebraic definition of iterative permutation is particularly useful for instantiating and systematically studying block ciphers and hash functions over $\mathbb{F}_p$ aimed for multiparty computation and zero-knowledge based cryptographic protocols. Finally, we provide the discrepancy analysis a technique used to measure the (pseudo-)randomness of a sequence, for analyzing the randomness of the sequence generated by the generic permutation or block cipher described by GTDS

Laser spectroscopy and cooling of Yb+ ions on a deep-UV transition

We perform laser spectroscopy of Yb+ ions on the 4f14 6s 2S_{1/2} - 4f13 5d 6s 3D[3/2]_{1/2} transition at 297 nm. The frequency measurements for 170Yb+, 172Yb+, 174Yb+, and 176Yb+ reveal the specific mass shift as well as the field shifts. In addition, we demonstrate laser cooling of Yb+ ions using this transition and show that light at 297 nm can be used as the second step in the photoionization of neutral Yb atoms

Kundenfreundliche und robuste Ersatzfahrpläne während Bau- und Unterhaltsintervallen

An der ZHAW wurde ein Verfahren entwickelt, um in kürzester Zeit Ersatzfahrpläne für Bau- und Unterhaltsintervalle zu erstellen – ein für den stabilen Bahnbetrieb zunehmend wichtiges Thema. Die Methode berücksichtigt nicht nur betriebliche Aspekte wie die temporären Einschränkungen der Bahnanlage, sondern stellt gleichzeitig auch den Kundennutzen ins Zentrum der Planung. Dadurch kann das beste Transportangebot in Bezug auf Reisezeiten und Zuverlässigkeit realisiert werden